翻訳と辞書 Words near each other ・ Constrained geometry complex ・ Constrained optimization ・ Constrained Shortest Path First ・ Constrained writing ・ Constrained-layer damping ・ Constraint ・ Constraint (classical mechanics) ・ Constraint (computer-aided design) ・ Constraint (information theory) ・ Constraint (mathematics) ・ Constraint algebra ・ Constraint algorithm ・ Constraint automaton ・ Constraint Composite Graph ・ Constraint counting ・ Constraint Grammar ・ Constraint graph ・ Constraint graph (layout) ・ Constraint Handling Rules ・ Constraint inference ・ Constraint learning ・ Constraint logic programming ・ Constraint programming ・ Constraint satisfaction ・ Constraint satisfaction dual problem ・ Constraint satisfaction problem ・ Constraint-based Routing Label Distribution Protocol ・ Constraint-induced movement therapy ・ Constraints accounting ・ Constricta Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Constraint Grammar ： ウィキペディア英語版 Constraint Grammar Constraint Grammar (CG) is a methodological paradigm for natural language processing (NLP). Linguist-written, context dependent rules are compiled into a grammar that assigns grammatical tags ("readings") to words or other tokens in running text. Typical tags address lemmatisation (lexeme or base form), inflexion, derivation, syntactic function, dependency, valency, case roles, semantic type etc. Each rule either adds, removes, selects or replaces a tag or a set of grammatical tags in a given sentence context. Context conditions can be linked to any tag or tag set of any word anywhere in the sentence, either locally (defined distances) or globally (undefined distances). Context conditions in the same rule may be linked, i.e. conditioned upon each other, negated, or blocked by interfering words or tags. Typical CGs consist of thousands of rules, that are applied set-wise in progressive steps, covering ever more advanced levels of analysis. Within each level, safe rules are used before heuristic rules, and no rule is allowed to remove the last reading of a given kind, thus providing a high degree of robustness. The Constraint Grammar concept was launched by Fred Karlsson in 1990 (Karlsson 1990; Karlsson et al., eds, 1995), and CG taggers and parsers have since been written for a large variety of languages, routinely achieving accuracy F-scores for part of speech (word class) of over 99%.〔For English, see for example Tapanainen and Voutilainen 1994.〕 A number of syntactic CG systems have reported F-scores of around 95% for syntactic function labels. CG systems can be used to create full syntactic trees in other formalisms by adding small, non-terminal based phrase structure grammars or dependency grammars, and a number of Treebank projects have used Constraint Grammar for automatic annotation. CG methodology has also been used in a number of language technology applications, such as spell checkers and machine translation systems. == Implementations == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Constraint Grammar」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.